首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4093篇
  免费   234篇
  国内免费   16篇
化学   3352篇
晶体学   16篇
力学   67篇
数学   425篇
物理学   483篇
  2023年   42篇
  2022年   28篇
  2021年   175篇
  2020年   141篇
  2019年   120篇
  2018年   62篇
  2017年   56篇
  2016年   176篇
  2015年   179篇
  2014年   163篇
  2013年   236篇
  2012年   339篇
  2011年   372篇
  2010年   210篇
  2009年   172篇
  2008年   291篇
  2007年   262篇
  2006年   259篇
  2005年   182篇
  2004年   191篇
  2003年   149篇
  2002年   127篇
  2001年   30篇
  2000年   31篇
  1999年   27篇
  1998年   19篇
  1997年   23篇
  1996年   25篇
  1995年   21篇
  1994年   15篇
  1993年   5篇
  1991年   7篇
  1990年   8篇
  1989年   9篇
  1988年   4篇
  1987年   9篇
  1986年   10篇
  1985年   19篇
  1984年   18篇
  1983年   17篇
  1982年   17篇
  1981年   18篇
  1980年   11篇
  1979年   8篇
  1978年   7篇
  1977年   13篇
  1976年   7篇
  1975年   6篇
  1974年   7篇
  1973年   4篇
排序方式: 共有4343条查询结果,搜索用时 390 毫秒
11.
According to the National Council of Teachers of Mathematics (2000), children need to learn how to create and use mathematical diagrams to represent and reason about phenomena in the world. The author proposes a model of diagram literacy that includes six types of knowledge required for diagrammatic competence - implicit, construction, similarity, structural, metacognitive, and translational. A study is reported that examined college students' diagram literacy for three interrelated mathematical diagrams - matrices, networks, and hierarchies. Three groups of students participated: preservice, secondary-level, math teachers; computer science majors; and typical undergraduates. The results of the study are reassuring in some ways concerning the level of diagram literacy possessed by students at the culmination of current K through 12 instruction and by teachers of future secondary students. However, the results also point to areas in which preservice math teachers should be better prepared if the goals for students' diagram literacy are to be met.  相似文献   
12.
This paper studies the problem of how changes in the design of the genetic algorithm (GA) have an effect on the results obtained in real-life applications. In this study, focused on the application of a GA to the tuning of technical trading rules in the context of financial markets, our tentative thesis is that the GA is robust with respect to design changes. The optimization of technical trading systems is a suitable area for the application of the GA metaheuristic, as the complexity of the problem grows exponentially as new technical rules are added to the system and as the answer time is crucial when applying the system to real-time data. Up to now, most of GAs applications to this subject obviated the question of possible “design dependence” in their results. The data we report, based on our experiments, do not allow us to refute the hypothesis of robustness of the GA to design implementation, when applying to technical trading systems tuning.  相似文献   
13.
We do the tentative beginnings of a study of BLT-sets of generalised quadrangles via their symmetries. In particular, the study of whorls about a line leads us to hyperbolic reflections preserving a BLT-set of Q(4, q).  相似文献   
14.
15.
Wet chemical synthesis of precursor oxide ceramics is a method to obtain small particulate powders. Such powders are far more prone to ageing in air than more traditional precursors. Thermogravimetric analysis is used to highlight the species responsible for the ageing of ceramic precursors. Indeed water and carbon dioxide are observed to evolve from aged powders. Ceramics obtained from aged precursors can reach a very low final density with respect to the theoretical value. A large degree of the original sintering properties can be recovered after washing the aged powders with ethanol in a basic medium.  相似文献   
16.
Supply Chain Management (SCM) is an important activity in all producing facilities and in many organizations to enable vendors, manufacturers and suppliers to interact gainfully and plan optimally their flow of goods and services. To realize this, a dynamic modelling approach for characterizing supply chain activities is opportune, so as to plan efficiently the set of activities over a distributed network in a formal and scientific way. The dynamical system will result so complex that it is not generally possible to specify the functional forms and the parameters of interest, relating outputs to inputs, states and stochastic terms by experiential specification methods. Thus the algorithm that will presented is Data Driven, determining simultaneously the functional forms, the parameters and the optimal control policy from the data available for the supply chain. The aim of this paper is to present this methodology, by considering dynamical aspects of the system, the presence of nonlinear relationships and unbiased estimation procedures to quantify these relations, leading to a nonlinear and stochastic dynamical system representation of the SCM problem. Moreover, the convergence of the algorithm will be proved and the satisfaction of the required statistical conditions demonstrated. Thus SCM problems may be formulated as formal scientific procedures, with well defined algorithms and a precise calculation sequence to determine the best alternative to enact. A “Certainty equivalent principle” will be indicated to ensure that the effects of the inevitable uncertainties will not lead to indeterminate results, allowing the formulation of demonstrably asymptotically optimal management plans.  相似文献   
17.
18.
Summary The role of multivariate analysis methods in evaluating, rationalizing, and working out complex environmental problems is discussed. The discussion is organized in two sections; a literature analysis of the application of chemometric methods to PCDD/PCDF data interpretation and source correlation and a review of the role of chemometric methods in analysing the results obtained by the Authors studying PCDD/PCDF formation and destruction mechanisms in MSW combustion processes.  相似文献   
19.
In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available. Received: 1 July 2002  相似文献   
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号